Symmetry and Interactivity in Programming
نویسندگان
چکیده
منابع مشابه
Symmetry and interactivity in Programming
We recall some of the early occurrences of the notions of interac-tivity and symmetry in the operational and denotational semantics of programming languages. We suggest some connections with ludics. Proof theory and programming are deeply intertwinned research areas. This short paper will address and compare ideas from both sides, so it seems appropriate to begin by recalling what this general ...
متن کاملInteractivity in Constraint Programming
In the current computing environment, the interactive behaviour of software is a significant feature requested by many users. The minimal perturbation problem is often highly demanded and, in a sense, it seems to be very close to the interactivity. In this paper we want to compare these two features and also summarize their main demands and impacts on the constraint satisfaction problem. We als...
متن کاملProgramming Interactivity Requires Both Semantics and Semiotics
Introduction. Programming languages are generally designed around models of computation, classes of programs, or populations of programmers. Considering interactive applications (e.g. games and single-page Web applications), we argue that programming language research could be usefully oriented around the end-user’s experience of interacting with the system. Operational logics, a theoretical fr...
متن کاملSymmetry and Logic Programming
We argue that some symmetric structure in logic programs should be taken into account when implementing semantics in logic programming. This can enhance the declarative or expressive power of the semantics. The work presented here may be seen as some representative examples along this line. The main focus is on the derivation of negative information and some other classical semantic issues. We ...
متن کاملSymmetry in Constraint Programming
Symmetry in constraints has always been important but in recent years has become a major research area in its own right. A key problem in constraint programming has long been recognised: search can revisit equivalent states over and over again. In principle this problem has been solved, with a number of different techniques. As we write, research remains very active for two reasons. First, ther...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Symbolic Logic
سال: 2003
ISSN: 1079-8986,1943-5894
DOI: 10.2178/bsl/1052669287